Splitting Proofs for Interpolation
نویسندگان
چکیده
We study interpolant extraction from local first-order refutations. We present a new theoretical perspective on interpolation based on clearly separating the condition on logical strength of the formula from the requirement on the common signature. This allows us to highlight the space of all interpolants that can be extracted from a refutation as a space of simple choices on how to split the refutation into two parts. We use this new insight to develop an algorithm for extracting interpolants which are linear in the size of the input refutation and can be further optimized using metrics such as number of non-logical symbols or quantifiers. We implemented the new algorithm in first-order theorem prover VAMPIRE and evaluated it on a large number of examples coming from the first-order proving community. Our experiments give practical evidence that our work improves the state-of-the-art in first-order interpolation.
منابع مشابه
Interpolant Strength Revisited
Craig’s interpolation theorem has numerous applications in model checking, automated reasoning, and synthesis. There is a variety of interpolation systems which derive interpolants from refutation proofs; these systems are ad-hoc and rigid in the sense that they provide exactly one interpolant for a given proof. In previous work, we introduced a parametrised interpolation system which subsumes ...
متن کاملVariations of the Splitting Box Scheme forAdaptive Generation of Contour
A widespread approach to generating iso-surfaces or contour surfaces in volume data is the so-called marching-cubes algorithm. This algorithm, however, has the disadvantage that the number of polygonal chains generated is considerable. Several attempts to reduce the size of output were undertaken in the past. For instance, we have suggested the splitting box approach. An important advantage aga...
متن کاملCircular Proofs for Gödel-Löb Logic
We present a sequent-style proof system for provability logic GL that admits so-called circular proofs. For these proofs, the graph underlying a proof is not a finite tree but is allowed to contain cycles. As an application, we establish Lindon interpolation for GL syntactically.
متن کاملInterpolation and Symbol Elimination
We prove several results related to local proofs, interpolation and superposition calculus and discuss their use in predicate abstraction and invariant generation. Our proofs and results suggest that symbol-eliminating inferences may be an interesting alternative to interpolation.
متن کاملAbsolute continuity and summability of transport densities: simpler proofs and new estimates
The paper presents some short proofs for transport density absolute continuity and L estimates. Most of the previously existing results which were proven by geometric arguments are re-proved through a strategy based on displacement interpolation and on approximation by discrete measures; some of them are partially extended.
متن کامل